Re ning enumeration schemes to count according to the inversion number Andrew
نویسندگان
چکیده
Abstract. Enumeration schemes were developed by Zeilberger, Vatter, and Pudwell as automatable methods to enumerate the set of permutations of length n which avoid a set of patterns B, Sn(B). In this paper we show how their schemes may be re ned to enumerate Sn(B) according to the inversion number of each permutation. Mathematics Subject Classi cation(2000). 05A05, 05A15, 05A30, 68R15.
منابع مشابه
Refining Enumeration Schemes to Count According to Inversion Number
Enumeration schemes were developed by Zeilberger, Vatter, and Pudwell as automatable methods to enumerate the set of permutations of length n which avoid a set of patterns B, Sn(B). In this paper we show how their schemes may be refined to enumerate Sn(B) according to the inversion number of each permutation.
متن کاملRefining Enumeration Schemes to Count According to Permutation Statistics
We develop algorithmic tools to compute quickly the distribution of permutation statistics over sets of pattern-avoiding permutations. More specfically, the algorithms are based on enumeration schemes, the permutation statistics are based on the number of occurrences of certain vincular patterns, and the permutations avoid sets of vincular patterns. We prove that whenever a finite enumeration s...
متن کاملSuitability of MRS-bile Agar for the Selective Enumeration of Mixed Probiotic Bacteria in Presence of Mesophilic Lactic Acid Cultures and Yoghurt Bacteria
Measuring the viability of probiotic microorganisms in food products using plate count methodology is a common practice due to the simplicity (ease of performance), inexpensive and routine testing characters ofthis method. In present study, the suitability of de man rogosa and sharpe agar (MRS) bile agar medium forthe selective enumeration of mixed probiotic bacteria (Lactobacillus ...
متن کاملEnumeration of Symmetry Classes of Convex Polyominoes in the Square Lattice
This paper concerns the enumeration of rotation-type and congruence-type convex polyominoes on the square lattice. These can be defined as orbits of the groups C4, of rotations, and D4, of symmetries, of the square, acting on (translation-type) polyominoes. In virtue of Burnside’s Lemma, it is sufficient to enumerate the various symmetry classes (fixed points) of polyominoes defined by the elem...
متن کاملThe Combinatorics behind Number-Theoretic Sieves
Ever since Viggo Brun's pioneering work, number theorists have developed increasingly sophisticated re nements of the sieve of Eratosthenes to attack problems such as the twin prime conjecture and Goldbach's conjecture. Ever since Gian-Carlo Rota's pioneering work, combinatorialists have found more and more areas of combinatorics where sieve methods (or M obius inversion) are applicable. Unfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010